programming semantics

Giving an operational semantics model of DFL programming language which can solve dynamic fuzzy problems and proving the correctness and reliability of it;

提出了可以解决动态模糊性问题的DFL程序设计语言的操作语义模型，并对该模型的正确性和可靠性进行了证明；

Denotational semantics describes the semantics of a programming language in afunctional way, but the first-order temporal logic expresses the semantics of a prog-ramming language in a logical way.

指称语义学是以函数的形式来表达程序的语义，一阶时态逻辑是以逻辑方式表达程序的语义。

One can also study Domain theory on denotational semantics of computer programming languages by using the topological system.

它可以用来研究计算机程序语言的指称语义的Domain理论。

Most model languages in the textbooks of monographs on programming semantics are so tiny languages, which cannot help to clarify the traits of real programming languages, for they failed to be used to write ordinary programs.

大部分研究程序设计语义专论中的语言模型功能都非常简单，这对阐明实际的程序设计语言是远远不够的，因为这些语言模型很少能完整地编写普通的实际程序。

The formal semantics of programming languages can provide concise and precise language definition. It helps people not only to understand well the language, but also to standardization of language.

程序语言的形式化语义提供简洁而精确的语言定义，不仅帮助人们很好的理解语言，而且有助于语言的标准化。

Constrasted with other semantics theories of nonmonotonic logic programming, Answer Set semantics, the kernel of Answer Set programming technology, is concise and simple, and fully utilizes the fruits acquired by the logic programming community, and effectively realizes nonmonotonic reasoning of the logic program.

作为该类编程技术的核心，Answer Set语义相对其它非单调逻辑编程语义理论简洁明了，它充分利用了逻辑编程领域的已有成果，有效地实现了逻辑程序的非单调推理。

Combinatory logic is proposed to be a mathematical foundation of the semantics of programming languages.

本文提出以合成逻辑（Combinatory logic）作为程序设计语言语义学的数学基础。

Introduces topological methods in domain theory of denotational semantics of computer programming languages.

讨论计算机程序设计语言的Domain理论中的拓扑方法。